A Note on the Pancyclism of Block Intersection Graphs of Universal-Friend Friendship Hypergraphs
نویسنده
چکیده
In this note, we consider the i-block intersection graphs (i-BIG) of a universal-friend friendship 3-hypergraph and show that they are pancyclic for i = 1, 2. We also show that the 1-BIG of a universalfriend friendship 3-hypergraph is Hamiltonian-connected.
منابع مشابه
On a Question of Sós About 3-Uniform Friendship Hypergraphs
The well-known Friendship Theorem states that ifG is a graph in which every pair of vertices has exactly one common neighbor, then G has a single vertex joined to all others (a “universal friend”). V. Sós defined an analogous friendship property for 3-uniformhypergraphs, andgave a construction satisfying the friendshipproperty that has auniversal friend.Wepresent new 3-uniformhypergraphs on 8, ...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملA sharp lower bound on the number of hyperedges in a friendship 3-hypergraph
Let (X,B) be a set system in which B is a set of 3-subsets of X. Then (X,B) is a friendship 3hypergraph if it satisfies the following property: for all distinct elements u, v, w ∈ X, there exists a unique fourth element x ∈ X such that {u, v, x}, {u,w, x}, {v, w, x} ∈ B. The element x is called the completion of u, v, w and we say u, v, w is completed by x. If a friendship 3-hypergraph contains...
متن کاملIntersection graphs of oriented hypergraphs and their matrices
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. Continuing the study of these matrices associated to an oriented hypergraph, several related structures are investigated including: the incidence dual, the intersection graph (line graph), and the 2-section. The intersection graph is show...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کامل